Codes and caps from orthogonal Grassmannians

نویسندگان

  • Ilaria Cardinali
  • Luca Giuzzi
چکیده

In this paper we investigate linear error correcting codes and projective caps related to the Grassmann embedding ε k of an orthogonal Grassmannian ∆k. In particular, we determine some of the parameters of the codes arising from the projective system determined by ε k (∆k). We also study special sets of points of ∆k which are met by any line of ∆k in at most 2 points and we show that their image under the Grassmann embedding ε k is a projective cap.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results on caps and codes related to orthogonal Grassmannians - a preview

In this note we offer a short summary of some recent results, to be contained in a forthcoming paper [4], on projective caps and linear error correcting codes arising from the Grassmann embedding ε k of an orthogonal Grassmannian ∆k. More precisely, we consider the codes arising from the projective system determined by ε k (∆k) and determine some of their parameters. We also investigate special...

متن کامل

Polar Grassmannians and their Codes

We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.

متن کامل

Enumerative coding for line polar Grassmannians with applications to codes

A k-polar Grassmannian is the geometry having as pointset the set of all k-dimensional subspaces of a vector space V which are totally isotropic for a given non-degenerate bilinear form μ defined on V. Hence it can be regarded as a subgeometry of the ordinary k-Grassmannian. In this paper we deal with orthogonal line Grassmannians and with symplectic line Grassmannians, i.e. we assume k = 2 and...

متن کامل

Minimum distance of Symplectic Grassmann codes

In this paper we introduce Symplectic Grassmann codes, in analogy to ordinary Grassmann codes and Orthogonal Grassmann codes, as projective codes defined by symplectic Grassmannians. Lagrangian–Grassmannian codes are a special class of Symplectic Grassmann codes. We describe all the parameters of line Symplectic Grassmann codes and we provide the full weight enumerator for the Lagrangian–Grassm...

متن کامل

7 M ay 2 00 9 New quantum caps in PG ( 4 , 4

Calderbank, Rains, Shor and Sloane (see [6]) showed that error-correction is possible in the context of quantum computations. Quantum stabilizer codes are a class of additive quaternary codes in binary projective spaces, which are self-orthogonal with respect to the symplectic form. A geometric description is given in [5], where also the notion of quantum cap is introduced. Quantum caps corresp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2013